Rosenberg , Reducibility and Consciousness
نویسنده
چکیده
Although original, intricate and sophisticated, Gregg Rosenberg’s core argument in favor of panpsychism is a version of an argument that has been around for some time. My paper tries to shed some light on Rosenberg's strategy by comparing it to the views of Leibniz (or a fictional philosopher close to him) who took a similar approach. At the heart of the argument is the idea that relational properties are reducible to intrinsic properties. I argue that Rosenberg's position follows in this tradition. If the reducibility thesis is correct then there must be intrinsic properties ‘behind’ the relational properties of matter revealed by science (what Rosenberg calls effective properties). A crude form of the argument proceeds from the further premise that the only intrinsic properties are those properties in virtue of which certain states are conscious. The argument thus requires defense of both the reducibility thesis and the uniqueness claim about consciousness, both of which present serious philosophical challenges.
منابع مشابه
Rosenberg on Causation
This paper is an explication and critique of a new theory of causation found in part II of Gregg Rosenberg's A Place for Consciousness. According to Rosenberg's Theory of Causal significance, causation constrains indeterminate possibilities, and according to his Carrier Theory, physical properties are dispositions which have phenomenal properties as their causal bases. This author finds Rosenbe...
متن کاملConstructing Minimal Pairs of Degrees
We prove that there exist sets of natural numbers A and B such that A and B form a minimal pair with respect to Turing reducibility, enumeration reducibility, hyperarithmetical reducibility and hyperenumer-ation reducibility. Relativized versions of this result are presented as well. 1. Introduction In the present paper we consider four kinds of reducibilities among sets of natural numbers: Tur...
متن کاملSparse Variations and Reducibility among Prediction Problems Authors :
We investigate the relationship between two di erent notions of reducibility among prediction (learning) problems within the distribution-free learning model of Valiant (PAC learning model [7, 2].) The notions of reducibility we consider are the analogues for prediction problems of the many-one reducibility and of the Turing reducibility. The former is the notion of prediction preserving reduci...
متن کاملParallel Reducibility for Information-Theoretically Secure Computation
Secure Function Evaluation (SFE) protocols are very hard to design, and reducibility has been recognized as a highly desirable property of SFE protocols. Informally speaking, reducibility (sometimes called modular composition) is the automatic ability to break up the design of complex SFE protocols into several simpler, individually secure components. Despite much effort, only the most basic ty...
متن کاملToward a General Rewriting-Based Framework for Reducibility
Reducibility is a powerful proof method which applies to various properties of typed terms in different type systems. For strong normalization, different variants are known, such as Girard’s reducibility candidates, Tait’s saturated sets and biorthogonals. They differ by the closure conditions imposed to types interpretations, called here reducibility families. This paper is about the computati...
متن کامل